全文获取类型
收费全文 | 2846篇 |
免费 | 122篇 |
国内免费 | 133篇 |
专业分类
电工技术 | 39篇 |
综合类 | 155篇 |
化学工业 | 105篇 |
金属工艺 | 32篇 |
机械仪表 | 136篇 |
建筑科学 | 187篇 |
矿业工程 | 216篇 |
能源动力 | 117篇 |
轻工业 | 55篇 |
水利工程 | 40篇 |
石油天然气 | 126篇 |
武器工业 | 8篇 |
无线电 | 286篇 |
一般工业技术 | 92篇 |
冶金工业 | 133篇 |
原子能技术 | 2篇 |
自动化技术 | 1372篇 |
出版年
2024年 | 3篇 |
2023年 | 16篇 |
2022年 | 38篇 |
2021年 | 61篇 |
2020年 | 51篇 |
2019年 | 37篇 |
2018年 | 59篇 |
2017年 | 68篇 |
2016年 | 76篇 |
2015年 | 98篇 |
2014年 | 169篇 |
2013年 | 172篇 |
2012年 | 155篇 |
2011年 | 223篇 |
2010年 | 153篇 |
2009年 | 176篇 |
2008年 | 182篇 |
2007年 | 218篇 |
2006年 | 216篇 |
2005年 | 209篇 |
2004年 | 136篇 |
2003年 | 150篇 |
2002年 | 80篇 |
2001年 | 67篇 |
2000年 | 73篇 |
1999年 | 29篇 |
1998年 | 38篇 |
1997年 | 29篇 |
1996年 | 18篇 |
1995年 | 15篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 8篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有3101条查询结果,搜索用时 78 毫秒
81.
Saowanee Lertworasirikul Peerayuth Charnsethikul Shu-Cherng Fang 《Computers & Industrial Engineering》2011,61(4):1017-1023
This paper studies the inverse Data Envelopment Analysis (inverse DEA) for the case of variable returns to scale (inverse BCC). The developed inverse BCC model can preserve relative efficiency values of all decision making units (DMUs) in a new production possibility set composing of all current DMUs and a perturbed DMU with new input and output values. We consider the inverse BCC model for a resource allocation problem, where increases of some outputs and decreases of the other outputs of the considered DMU can be taken into account simultaneously. The inverse BCC problem is in the form of a multi-objective nonlinear programming model (MONLP), which is not easy to solve. We propose a linear programming model, which gives a Pareto-efficient solution to the inverse BCC problem. However, there exists at least an optimal solution to the proposed model if and only if the new output vector is in the set of current production possibility set. The proposed approach is illustrated via a case study of a motorcycle-part company. 相似文献
82.
We consider a single machine scheduling problem with resource dependent release times that can be controlled by a non-increasing convex resource consumption function. The objective is to minimize the weighted total resource consumption and sum of job completion times with an initial release time greater than the total processing times. It is known that the problem is polynomially solvable in O(n4) with n the number of jobs. 相似文献
83.
Online algorithms for advance resource reservations 总被引:2,自引:0,他引:2
C. CastilloAuthor Vitae G.N. RouskasAuthor Vitae 《Journal of Parallel and Distributed Computing》2011,71(7):963-973
We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to allocate resources to users based on agreed-upon QoS requirements and increase the predictability of a Grid system, yet incorporating such mechanisms into current Grid environments has proven to be a challenging task due to the resulting resource fragmentation. We use concepts from computational geometry to present a framework for tackling the resource fragmentation, and for formulating a suite of scheduling strategies. We also develop efficient implementations of the scheduling algorithms that scale to large Grids. We conduct a comprehensive performance evaluation study using simulation, and we present numerical results to demonstrate that our strategies perform well across several metrics that reflect both user- and system-specific goals. Our main contribution is a timely, practical, and efficient solution to the problem of scheduling resources in emerging on-demand computing environments. 相似文献
84.
85.
A trust degree based access control in grid environments 总被引:1,自引:0,他引:1
The purpose of grid computing is to enable coordinated resource sharing and support cooperative work between different domains in dynamic grid environments. In order to protect each participant’s privilege and security, a secure and efficient access control is essential. This paper presents a new approach of access mechanism based on trust relationships across domains. A new calculation method of trust in grid is proposed and the difference between intro-domain trust and inter-domain trust is analyzed. In addition, a novel access control framework combined with trust degree is given from this proposal. It is shown to be adaptive for both intro-domain and inter-domain conditions. Hence, a prototype system based on the proposed model is introduced; furthermore, it has been shown as a dynamic and fine-granularity access control method through performance analyses and has also been demonstrated as a suitable system for grid environments. 相似文献
86.
Fei Yin Changjun Jiang Rong Deng Jianjun Yuan 《Computers & Electrical Engineering》2009,35(6):966-979
The resource management is the central component of grid system. The analysis of the workload log file of LCG including the job arrival and the resource utilization daily cycle shows that the idle sites in the Grid are the source of load imbalance and energy waste. Here we focus on these two issues: balancing the workload by transferring jobs to idle sites at prime time to minimize the response time and maximize the resource utilization; power management by switch the idle sites to sleeping mode at non-prime time to minimize the energy consume. We form the M/G/1 queue model with server vacations, startup and closedown to analysis the performance metrics to instruct the design of load-balancing and energy-saving policies. We provide our Adaptive Receiver Initiated (ARI) load-balancing strategy and power-management policy for energy-saving. The simulation experiments prove the accuracy of our analysis and the comparisons results indicate our policies are largely suitable for large-scale heterogeneous grid environment. 相似文献
87.
Vipul Mathur Author Vitae Varsha Apte Author Vitae 《Journal of Systems and Software》2009,82(1):39-55
A Web server, when overloaded, shows a severe degradation of goodput initially, with the eventual settling of goodput as load increases further. Traditional performance models have failed to capture this behavior. In this paper, we propose an analytical model, which is a two-stage and layered queuing model of the Web server, which is able to reproduce this behavior. We do this by explicitly modelling the overhead processing, the user abandonment and retry behavior, and the contention for resources, for the FIFO and LIFO queuing disciplines. We show that LIFO provides better goodput in most overload situations. We compare our model predictions with experimental results from a test bed and find that our results match well with measurements. 相似文献
88.
Secure authentication features of communication and electronic commerce protocols involve computationally expensive and memory intensive cryptographic operations that have the potential to be turned into denial-of-service (DoS) exploits. Recent proposals attempt to improve DoS resistance by implementing a trade-off between the resources required for the potential victim(s) with the resources used by a prospective attacker. Such improvements have been proposed for the Internet Key Exchange (IKE), the Just Fast Keying (JFK) key agreement protocol and the Secure Sockets Layer (SSL/TLS) protocol. In present article, we introduce probabilistic model checking as an efficient tool-assisted approach for systematically quantifying DoS security threats. We model a security protocol with a fixed network topology using probabilistic specifications for the protocol participants. We attach into the protocol model, a probabilistic attacker model which performs DoS related actions with assigned cost values. The costs for the protocol participants and the attacker reflect the level of some resource expenditure (memory, processing capacity or communication bandwidth) for the associated actions. From the developed model we obtain a Discrete Time Markov Chain (DTMC) via property preserving discrete-time semantics. The DTMC model is verified using the PRISM model checker that produces probabilistic estimates for the analyzed DoS threat. In this way, it is possible to evaluate the level of resource expenditure for the attacker, beyond which the likelihood of widespread attack is reduced and subsequently to compare alternative design considerations for optimal resistance to the analyzed DoS threat. Our approach is validated through the analysis of the Host Identity Protocol (HIP). The HIP base-exchange is seen as a cryptographic key-exchange protocol with special features related to DoS protection. We analyze a serious DoS threat, for which we provide probabilistic estimates, as well as results for the associated attacker and participants' costs. 相似文献
89.
P. Mazzoleni B. Crispo S. Sivasubramanian E. Bertino 《The Journal of supercomputing》2009,49(1):108-126
In this paper, we present a novel resource brokering service for grid systems which considers authorization policies of the
grid nodes in the process of selecting the resources to be assigned to a request. We argue such an integration is needed to
avoid scheduling requests onto resources the policies of which do not authorize their execution. Our service, implemented
in Globus as a part of Monitoring and Discovery Service (MDS), is based on the concept of fine-grained access control (FGAC) which enables participating grid nodes to specify fine-grained policies concerning the conditions under which grid
clients can access their resources. Since the process of evaluating authorization policies, in addition to checking the resource
requirements, can be a potential bottleneck for a large scale grid, we also analyze the problem of the efficient evaluation
of FGAC policies. In this context, we present GroupByRule, a novel method for policy organization and compare its performance with other strategies.
相似文献
E. BertinoEmail: |
90.
This paper presents a fuzzy system for controlling the fire command in a surface-to-surface engagement by assuming siege of friendly side by enemy forces. The system must be capable of interacting with a dynamic and uncertain battle world in a real-time manner. In siege situation, it is assumed that the enemy troops are advancing toward friendly side in different directions and the defence resources are limited and nonrenewable at a single platform. Thus, resource allocation problem in a real-time manner is an important and vital component of battle management until coming of auxiliary forces. This paper addresses the design of a fuzzy system as an efficient tool for real-time decision-making in order to optimize the defense resource allocation in engagement. 相似文献